A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

用户偏好提取MDP建模研究

将马尔可夫判决过程和智能强化学习算法相结合,给出了异构无线网络环境下用户业务偏好评估模型的技术框架。为动态环境下用户需求的感知、量化和适配特征的研究提供了基本的数学描述,对解决用户体验的评价问题和业务与业务环境的适配问题提供了新的研究思路。仿真结果表明所构建的MDP模型能够在多状态条件下学习用户偏好,根据用户需求智能选择业务。     

Opportunistic retooling of a flexible machine subject to failure

A set of jobs can be processed without interruption by a flexible machine only if the set of tools required by all jobs can be loaded in the tool magazine. However, in practice the total number of tools required by a job set would exceed the tool magazine capacity. In such situations, the job set has to be carefully partitioned at the start of the production run such that each partition can be processed without interruption. During the production run, if there are unscheduled machine downtimes due to machine failure, this provides an additional opportunity to optimally retool the magazine for a smaller job set consisting of just the unprocessed jobs. In this paper, we study job sequencing rules that allow us to minimize the total expected cost of machine down time due to machine failures and magazine retooling, assuming a dynamic re‐sequencing of the unprocessed jobs after each machine failure. Using these rules, we develop a branch‐and‐bound heuristic that allows us to solve problems of reasonable size. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 79–97, 2001     

上下文感知的深度弱监督图像哈希表示学习方法

针对现有深度监督图像哈希表示学习方法依赖于图像的类别信息,难以在现实中被广泛应用问题,利用与图像相关的标签信息作为监督信息,提出上下文感知的深度弱监督图像哈希表示学习方法。该方法一方面通过自适应捕获图像区域特征的相关上下文来增强它们的表示能力,另一方面通过引入判别损失来提高学习到的哈希码表示的判别性。在现有两个公开数据集上的大量实验结果证明了该方法的有效性。     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

一种基于神经网络的彩色图像分割方法

提出了适于彩色图像分割的加强型径向基函数网络方法,采用在线自适应聚类学习算法确定隐层节点的数目、激活函数中心值;通过Hebb学习算法迅速将隐层节点中心值分为目标颜色聚类中心和背景颜色聚类中心两类;输出层用竞争规则将目标与背景分开。通过对多幅彩色图像进行分割处理验证了该方法的有效性。     

谈军校学报在院校科研活动中的能动作用

军校学报在院校的科研活动中不仅仅是学术交流的园地、成果展示的平台，同时，也在整合研究力量，引导学科建设；促进学术协作，推进研究深入；提高学术水平，优化作者队伍方面起着积极的作用。可以说军校学报在院校科研活动中发挥着积极的能动作用。     

超精密金刚石车床伺服进给数学模型

首先分析了车床进给系统各环节的传递函数,在此基础上采用频域估计建模和时域建模方法建立了车床伺服进给系统的Ｓ域和Ｚ域模型     

基于神经网络的超精密机床伺服进给非线性模型辨识

以双轴Ｔ型结构的超精密金刚石车床的伺服进给系统为研究对象,采用自构造神经网络技术,建立了系统的非线性动态数学模型,为系统非线性控制与补偿提供参考模型     

机枪浮动技术研究

介绍了一种环形弹簧浮动机在大口径机枪上实现的可能性,说明了采用环形弹簧可以使大口径机枪获得浮动。建立了武器系统的动力学模型和目标函数,用优化设计的方法确定了环形弹簧的设计参数,并对某型高射机枪进行了动力分析。